Search results for "Text string"

showing 2 items of 2 documents

Irredundant tandem motifs

2014

Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques proposed to extract irredundant motifs are not suitable when the motifs to search for are structured, i.e., they are made of two (or several) subwords that co-occur in a text string s of length n. The main effort of this work is studying and characterizing a compact class of tandem motifs, that is, pairs of substrings {m1, m2} occurring in tandem within a maximum distance of d symbols in s, where d is an integer constant given in input. To this aim, we first introduce the concept of maximality, related to four specific conditions that h…

CombinatoricsDiscrete mathematicsMotifs Tandem Patterns Irredundant motifs String algorithm Suffix treeGeneral Computer ScienceTandemlawSuffix treeText stringSubstringTheoretical Computer ScienceLinear numberMathematicslaw.inventionTheoretical Computer Science
researchProduct

Characterization and Extraction of Irredundant Tandem Motifs

2012

We address the problem of extracting pairs of subwords (m1,m2) from a text string s of length n, such that, given also an integer constant d in input, m1 and m2 occur in tandem within a maximum distance of d symbols in s. The main effort of this work is to eliminate the possible redundancy from the candidate set of the so found tandem motifs. To this aim, we first introduce the concept of maximality, characterized by four specific conditions, that we show to be not deducible by the corresponding notion of maximality already defined for "simple" (i.e., non tandem) motifs. Then, we further eliminate the remaining redundancy by defining the concept of irredundancy for tandem motifs. We prove t…

Discrete mathematicsRedundancy (information theory)TandemMotif extraction Pattern discoveryText stringLinear numberMathematics
researchProduct